A general limit lifting theorem for 2-dimensional monad theory
نویسندگان
چکیده
منابع مشابه
A general theory for gauge-free lifting
A theory for lifting equations of motion for charged particle dynamics, subject to given electromagnetic like forces, up to a gauge-free system of coupled Hamiltonian Vlasov-Maxwell like equations is given. The theory provides very general expressions for the polarization and magnetization vector fields in terms of the particle dynamics description of matter. Thus, as is common in plasma physic...
متن کاملThe Local Limit Theorem: A Historical Perspective
The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...
متن کاملAn equational notion of lifting monad
We introduce the notion of an equational lifting monad: a commutative strong monad satisfying one additional equation (valid for monads arising from partial map classifiers). We prove that any equational lifting monad has a representation by a partial map classifier such that the Kleisli category of the former fully embeds in the partial category of the latter. Thus equational lifting monads pr...
متن کاملA General Limit Theorem for Recursive Algorithms and Combinatorial Structures
Limit laws are proven by the contraction method for random vectors of a recursive nature as they arise as parameters of combinatorial structures such as random trees or recursive algorithms, where we use the Zolotarev metric. In comparison to previous applications of this method, a general transfer theorem is derived which allows us to establish a limit law on the basis of the recursive structu...
متن کاملA ZPP Lifting Theorem
The complexity class ZPP (corresponding to zero-error randomized algorithms with access to one NP oracle query) is known to have a number of curious properties. We further explore this class in the settings of time complexity, query complexity, and communication complexity. r For starters, we provide a new characterization: ZPP equals the restriction of BPP where the algorithm is only allowed t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2018
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2017.09.018